@InProceedings{FerreiraAndMagFraPen:2013:PaSwLi,
               author = "Ferreira, Chaulio R. and Andrade, Marcus V. A. and Magalhaes, 
                         Salles V. G. and Franklin, W. R. and Pena, Guilherme C.",
          affiliation = "{Universidade Federal de Vi{\c{c}}osa (UFV)} and {Universidade 
                         Federal de Vi{\c{c}}osa (UFV)} and {Universidade Federal de 
                         Vi{\c{c}}osa (UFV)} and {Rensselaer Polytechnic Institute} and 
                         {Universidade Federal de Vi{\c{c}}osa (UFV)}",
                title = "A parallel sweep line algorithm for visibility computation",
            booktitle = "Anais...",
                 year = "2013",
               editor = "Andrade, Pedro Ribeiro and Santanch{\`e}, Andr{\'e}",
                pages = "12",
         organization = "Simp{\'o}sio Brasileiro de Geoinform{\'a}tica, 14. (GEOINFO).",
            publisher = "Instituto Nacional de Pesquisas Espaciais (INPE)",
              address = "S{\~a}o Jos{\'e} dos Campos",
             abstract = "This paper describes a new parallel raster terrain visibility (or 
                         viewshed) algorithm, based on the sweep-line model of [Van Kreveld 
                         1996]. Computing the terrain visible from a given observer is 
                         required for many GIS applications, with applications ranging from 
                         radio tower siting to aesthetics. Processing the newly available 
                         higher resolution terrain data requires faster architectures and 
                         algorithms. Since the main improvements on modern processors come 
                         from multi-core architectures, parallel programming provides a 
                         promising means for developing faster algorithms. Our algorithm 
                         uses the economical and widely available shared memory model with 
                         OpenMP. Experimentally, our parallel speedup is almost linear. On 
                         16 parallel processors, our algorithm is up to 12 times faster 
                         than the serial implementation.",
  conference-location = "Campos do Jord{\~a}o",
      conference-year = "24-27 nov. 2013",
                 issn = "2179-4820",
             language = "en",
                  ibi = "8JMKD3MGP8W/3FCBR3B",
                  url = "http://urlib.net/ibi/8JMKD3MGP8W/3FCBR3B",
           targetfile = "paper9.pdf",
        urlaccessdate = "18 maio 2024"
}